Grid-search wolf pack optimization algorithm for two-dimensional OTSU image segmentation
نویسندگان
چکیده
منابع مشابه
An Improved Two-Dimensional OTSU Segmentation Method for Nvshu Character Image
For the structural characteristics of Chinese NvShu character, this paper proposes an improved two-dimensional (2-D) OTSU segmentation method based on the lateral inhibition network for Nvshu character image. A 2-D histogram with the gray level and the lateral inhibition level of the image was established and the maximum between-cluster variance was chosen as the criterion to select the optimal...
متن کاملOtsu based Multi-level Image Segmentation using Brownian Bat Algorithm
In this work, bi-level and multi-level segmentation is proposed for the grey image dataset using a novel Brownian Bat Algorithm (BBA). Maximization of Otsu's between-class variance function is chosen as the objective function. The performance of the proposed CBA is demonstrated by considering five benchmark images and compared with the existing bat algorithms such as Traditional Bat Algori...
متن کاملImage Segmentation Research Based on GA and Improved Otsu Algorithm
In the face of the problem of high complexity of two-dimensional Otsu adaptive threshold algorithm, a new fast and effective Otsu image segmentation algorithm is proposed based on genetic algorithm. This algorithm replaces the segmentation threshold of the traditional two dimensional Otsu method by finding the threshold of two one-dimensional Otsu methods it reduces the computational complexity...
متن کاملImproved Cuckoo Search Algorithm for Global Optimization
The cuckoo search algorithm is a recently developedmeta-heuristic optimization algorithm, which is suitable forsolving optimization problems. To enhance the accuracy andconvergence rate of this algorithm, an improved cuckoo searchalgorithm is proposed in this paper. Normally, the parametersof the cuckoo search are kept constant. This may lead todecreasing the efficiency of the algorithm. To cop...
متن کاملIterated Local Search Algorithm for the Constrained Two-Dimensional Non-Guillotine Cutting Problem
An Iterated Local Search method for the constrained two-dimensional non-guillotine cutting problem is presented. This problem consists in cutting pieces from a large stock rectangle to maximize the total value of pieces cut. In this problem, we take into account restrictions on the number of pieces of each size required to be cut. It can be classified as 2D-SLOPP (two dimensional single large o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Physics: Conference Series
سال: 2019
ISSN: 1742-6588,1742-6596
DOI: 10.1088/1742-6596/1419/1/012038